Distributed Nash Equilibrium Seeking for Games in Systems With Bounded Control Inputs

نویسندگان

چکیده

Noticing that actuator limitations are ubiquitous in practical engineering systems, this article considers Nash equilibrium seeking for games systems where the control inputs bounded. More specifically, first-order integrator-type with bounded first considered and two saturated strategies designed to seek of game. Then, second-order further considered. In case, a centralized strategy is proposed without considering boundedness inputs, followed by distributed counterpart. By adapting saturation function into strategy, input addressed. strategies, consensus protocols included information sharing functions utilized construct inputs. The convergence results analytically studied Lyapunov stability analysis. Finally, connectivity mobile sensor networks, methods numerically verified.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Distributed Nash Equilibrium Seeking in Networked Graphical Games

This paper considers a distributed gossip approach for finding a Nash equilibrium in networked games on graphs. In such games a player’s cost function may be affected by the actions of any subset of players. An interference graph is employed to illustrate the partially-coupled cost functions and the asymmetric information requirements. For a given interference graph, network communication betwe...

متن کامل

Stochastic Nash Equilibrium Seeking for Games with General Nonlinear Payoffs

We introduce a multi-input stochastic extremum seeking algorithm to solve the problem of seeking Nash equilibria for a noncooperative game whose N players seek to maximize their individual payoff functions. The payoff functions are general (not necessarily quadratic), and their forms are not known to the players. Our algorithm is a nonmodel-based approach for asymptotic attainment of the Nash e...

متن کامل

Nash Equilibrium Seeking for Dynamic Systems with Non-Quadratic Payoffs

We consider a general, stable nonlinear dynamic system with N inputs and N outputs, where in the steady state, the output signals represent the non-quadratic payoff functions of a noncooperative game played by the values of the input signals. We introduce a non-model based approach for locally stable convergence to a steady-state Nash equilibrium. In classical game theory algorithms, each playe...

متن کامل

Nash Equilibrium Strategy for Bi-matrix Games with L-R Fuzzy Payoffs

In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...

متن کامل

Distributed Nash equilibrium seeking: A gossip-based algorithm

This paper presents an asynchronous gossip-based algorithm for finding aNash equilibrium (NE) of a game in a distributedmulti-player network. The algorithm is designed in such away that playersmake decisions based on estimates of the other players’ actions obtained from local neighbors. Using a set of standard assumptions on the cost functions and communication graph, the paper proves almost su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2021

ISSN: ['0018-9286', '1558-2523', '2334-3303']

DOI: https://doi.org/10.1109/tac.2020.3027795